Tackling the Qualification Problem using Fluent Dependency Constraints
نویسندگان
چکیده
منابع مشابه
Tackling the Qualification Problem Using Fluent Dependency Constraints
In the area of formal reasoning about action and change, one of the fundamental representation problems is providing concise modular and incremental specifications of action types and world models, where instantiations of action types are invoked by agents such as mobile robots. Provided the preconditions to the action are true, their invocation results in changes to the world model concomitant...
متن کاملTackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent dependency constraints together with the use of durational fluents can be used to deal with problems associated with action qualification. We provide both a weak and a strong form of qualification and demonstrate the approach...
متن کاملCausality and the Qualification Problem
In formal theories for reasoning about actions, the qualification problem denotes the problem to account for the many conditions which, albeit being unlikely to occur, may prevent the successful execution of an action. By a simple counter-example in the spirit of the well-known Yale Shooting scenario, we show that the common straightforward approach of globally minimizing such abnormal disquali...
متن کاملOn Solving the Qualification Problem
The qualification problem may be the most fundamental difficulty in formalizing common sense knowledge in general, and in formalizing knowledge about action in particular. This position paper argues that the qualification problem is intrinsicallycomputational as opposed to representational. This does not imply that explicit, formal, knowledge has no role in the production of commonsensical beha...
متن کاملTackling the Minimal Superpermutation Problem
A superpermutation on n symbols is a string that contains each of the n! permutations of the n symbols as a contiguous substring. The shortest superpermutation on n symbols was conjectured to have length ∑n i=1 i!. The conjecture had been verified for n ≤ 5. We disprove it by exhibiting an explicit counterexample for n = 6. This counterexample was found by encoding the problem as an instance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence
سال: 2000
ISSN: 0824-7935,1467-8640
DOI: 10.1111/0824-7935.00111